Dispatching of a Process

Items arrive at a processing plant at a Folsson rate X . At time T , all Items are dispatched from the system. An Intermediate dispatch time Is to be chosen to minimize the total wait of all Items. It Is shown that If the dispatch time must be chosen at time 0 then T/2 not only minimizes the expected total wait but it also maximizes the probability that the total wait is less than a for every a > 0 . If the intermediate dispatch time is allowed to be a (random) stopping time, then It is shown that the policy which dispatches at time t iff N(t) >_ X(T t) is optimal, where N(t) denotes the number of items present at time t . The distribution of the optimal dispatch time and the optimal expected total wait are determined. A generalization to the case of a nonhomogeneous Folsson Process, a time lag, and batch arrivals is given. Finally, the case where the process goes on indefinitely and any number of dispatches are allowed (at a cost K per dispatch) is considered, i r WftlilftilcOjKlr «w-fiift*.